Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies
نویسنده
چکیده
We show that some natural re nements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar re nements of the polynomial-time hierarchy. This extends a result of H.-J. Burtschik and H. Vollmer on relationship between the Straubing and the polynomial hierarchies. In particular, this applies to the boolean hierarchy and the plus{hierarchy.
منابع مشابه
Programming Languages Capturing Complexity Classes
We investigate an imperative and a functional programming language. The computational power of fragments of these languages induce two hierarchies of complexity classes. Our first main theorem says that these hierarchies match, level by level, a complexity-theoretic alternating space-time hierarchy known from the literature. Our second main theorems says that a slightly different complexity-the...
متن کاملModular quantifiers
In the late nineteen-eighties much of our research concerned the application of semigroup-theoretic methods to automata and regular languages, and the connection between computational complexity and this algebraic theory of automata. It was during this period that we became aware of the work of Wolfgang Thomas. Thomas had undertaken the study of concatenation hierarchies of star-free regular la...
متن کاملProof-theoretic analysis by iterated reflection
Progressions of iterated reflection principles can be used as a tool for ordinal analysis of formal systems. Technically, in some sense, they replace the use of omega-rule. We compare the information obtained by this kind of analysis with the results obtained by the more usual proof-theoretic techniques. In some cases the techniques of iterated reflection principles allows to obtain sharper res...
متن کاملA Short Excursion into Semi-Algebraic Hierarchies
This brief survey gives a (roughly) self-contained overview of some complexity theoretic results about semi-algebraic proof systems and related hierarchies and the strong connections between them. The article is not intended to be a detailed survey on “Lift and Project” type optimization hierarchies (cf. Chlamtac and Tulsiani [12]) or related proof systems (cf. Grigoriev et al. [16]).
متن کاملElliptic Algebro-geometric Solutions of the Kdv and Akns Hierarchies – an Analytic Approach
We provide an overview of elliptic algebro-geometric solutions of the KdV and AKNS hierarchies, with special emphasis on Floquet theoretic and spectral theoretic methods. Our treatment includes an effective characterization of all stationary elliptic KdV and AKNS solutions based on a theory developed by Hermite and Picard.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 36 شماره
صفحات -
تاریخ انتشار 2001